The ElGamal cryptosystem over circulant matrices
نویسنده
چکیده
In this paper we study extensively the discrete logarithm problem in the group of non-singular circulant matrices. The emphasis of this study was to find the exact parameters for the group of circulant matrices for a secure implementation. We tabulate these parameters. We also compare the discrete logarithm problem in the group of circulant matrices with the discrete logarithm problem in finite fields and with the discrete logarithm problem in the group of rational points of an elliptic curve.
منابع مشابه
A Simple Generalization of the Elgamal Cryptosystem to Non-abelian Groups
In this article we study the MOR cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian group in the MOR cryptosystem. We show that a cryptosystem similar to the ElGamal cryptosystem over finite fields can be built using the proposed groups and a set of automorphisms of these groups. We also show that the security of this proposed MOR cryptosystem is equ...
متن کاملA simple generalization of the El-Gamal cryptosystem to non-abelian groups II
The MOR cryptosystem is a generalization of the ElGamal cryptosystem, where the discrete logarithm problem works in the automorphism group of a group G, instead of the group G itself. The framework for the MOR cryptosystem was first proposed by Paeng et al. [13]. Mahalanobis [10] used the group of unitriangular matrices for the MOR cryptosystem. That effort was successful: the MOR cryptosystem ...
متن کاملThe discrete logarithm problem in the group of non-singular circulant matrices
The discrete logarithm problem is one of the backbones in public key cryptography. In this paper we study the discrete logarithm problem in the group of circulant matrices over a finite field. This gives rise to secure and fast public key cryptosystems.
متن کاملThe Discrete Logarithm problem in the ElGamal cryptosystem over the abelian group U(n) Where n= p^m, or 2p^m
This study is mainly about the discrete logarithm problem in the ElGamal cryptosystem over the abelian group U(n) where n is one of the following forms p, or 2p where p is an odd large prime and m is a positive integer. It is another good way to deal with the ElGamal Cryptosystem using that abelian group U(n)={x: x is a positive integer such that x<n and gcd(n,x)=1} in the setting of the discre...
متن کاملComputation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011